Optimal arrangement of data in a tree directory
نویسندگان
چکیده
منابع مشابه
Optimal arrangement of data in a tree directory
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between pairs of vertices measured with respect to the tree topology is at most a given value. We show that data arrangement is strongly NP-complete for any fixed d ≥ 2 and explain the connection between data arrangement and ar...
متن کاملOptimal Arrangement of Leaves in the Tree Representing Hierarchical Clustering of Gene Expression Data
In this paper, we study how to present gene expression data to display similarities by trying to find a linear ordering of genes such that genes with similar expression profiles will be close in this ordering. In general, finding the best possible order is intractable, and furthermore an unrestricted ordering may not be desired. Therefore we concentrate on the case in which hierarchical cluster...
متن کاملComputing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems
Divide-and-conquer approximation algorithms for vertex ordering problems partition the vertex set of graphs, compute recursively an ordering of each part, and “glue” the orderings of the parts together. The computed ordering is specified by a decomposition tree that describes the recursive partitioning of the subproblems. At each internal node of the decomposition tree, there is a degree of fre...
متن کاملOptimal Selection of Underground Parking Lines Arrangement: A Case Study of Tehran Subway Line 7
Due to the development of urban subway lines in order to extend public transportation and to accommodate the increased number of trains, depot and parking are necessary. This is to provide a space for parking trains in non-operating hours and to carry out maintenance and repair operations on trains. Subway depot is a predetermined space where trains, washing, car parks, and refueling work are p...
متن کاملOptimal hash arrangement of tentacles in jellyfish
At first glance, the trailing tentacles of a jellyfish appear to be randomly arranged. However, close examination of medusae has revealed that the arrangement and developmental order of the tentacles obey a mathematical rule. Here, we show that medusa jellyfish adopt the best strategy to achieve the most uniform distribution of a variable number of tentacles. The observed order of tentacles is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00174-3